Transitive 1-perfect codes from quadratic functions
نویسندگان
چکیده
منابع مشابه
Properties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16
Properties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16 Abstract. Some properties of perfect transitive binary codes of length 15 and extended perfect transitive binary codes of length 16 are presented for reference purposes. The attached files contain some tab-delimited properties of perfect binary codes of length 15 and extended per...
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملBinary quasi-perfect linear codes from APN quadratic functions
A mapping f from F2m to itself is almost perfect nonlinear (APN) if its directional derivatives in nonzero directions are all 2-to-1. Let Cf be the binary linear code of length 2 − 1, whose parity check matrix has its j-th column [ π f(π) ] , where π is a primitive element in F2m and j = 0, 1, · · · , 2 − 2. For m ≥ 3 and any quadratic APN function f(x) = ∑m−1 i,j=0 ai,jx 2+2 , ai,j ∈ F2m , it ...
متن کاملQuadratic Residue Codes and Divisibility
Quadratic residue codes are some of the brightest gems of coding theory. Their facets reeect many topics: quadratic residues and reciprocity; multiply transitive and sporadic simple groups; lattices; group representations; and block designs and Hadamard matrices. They provide the only perfect codes for prime-power sized alphabets correcting more than one error, and some are prototypes of extrem...
متن کاملSchemes, Codes and Quadratic Zero-Difference Balanced Functions
Zero-difference balanced (ZDB) functions were introduced by Ding for the constructions of optimal and perfect systems of sets and of optimal constant composition codes. In order to be used in these two areas of application, ZDB functions have to be defined on cyclic groups. In this paper, we investigate quadratic ZDB functions from the additive group of Fpn to itself of the form G(x t+1), where...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1301.0014 شماره
صفحات -
تاریخ انتشار 2012